Region Based Contour Detection by Dynamic Programming
نویسندگان
چکیده
Dynamic programming (DP) is a popular technique for contour detection, particularly in biomedical image analysis. Although gradient information is typically used in such methods, it is not always a reliable measure to work with and there is a strong need of non-gradient based methods. In this paper we present a general framework for region based contour detection by dynamic programming. It is based on a global energy function which is approximated by a radial ray-wise summation to enable dynamic programming. Its simple algorithmic structure allows to use arbitrarily complex region models and model testing functions, in particular by means of techniques from robust statistics. The proposed framework was tested on synthetic data and real microscopic images. A performance comparison with the standard gradient-based DP and a recent non-gradient DP-based contour detection algorithm clearly demonstrates the superiority of our approach.
منابع مشابه
Automatic contour detection by encoding knowledge into active contour models
An original method for an automatic detection of contours in difficult images is proposed. This method is based on a tight cooperation between a multi-resolution neural network and a hidden Markov model-enhanced dynamic programming procedure. This new method is able to overcome the three major drawbacks of the “standard” active contours: initialization dependancy, exclusive use of local informa...
متن کاملIntensity and Morphology-Based Energy Minimization for the Automatic Segmentation of the Myocardium
The extraction of significant cardiac functional parameters such as ejection fraction and wall thickening depends on reliable detection of myocardial contours. However, the manual contour tracing process is cumbersome, time-consuming, and operator-dependent. These limitations have motivated the development of automated segmentation techniques for accurate and reproducible left ventricular (LV) ...
متن کاملPii: S0895-6111(00)00075-6
We present a new multiscale approach for deformable contour optimization. The method relies on a multigrid minimization method and a coarse-to-®ne relaxation algorithm. This approach consists in minimizing a cascade of optimization problems of reduced and increasing complexity instead of considering the minimization problem on the full and original con®guration space. Contrary to classical mult...
متن کاملReliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries. One main concern is to restrict the search space. Different solutions to this problem have been proposed. Presented in this paper is a double dynamic programming approach which is both optimal and computationally fast....
متن کاملContours Extraction Using Line Detection and Zernike Moment
Most of the contour detection methods suffers from some drawbacks such as noise, occlusion of objects, shifting, scaling and rotation of objects in image which they suppress the recognition accuracy. To solve the problem, this paper utilizes Zernike Moment (ZM) and Pseudo Zernike Moment (PZM) to extract object contour features in all situations such as rotation, scaling and shifting of object i...
متن کامل